Solution of symmetric positive semidefinite Procrustes problem
نویسندگان
چکیده
منابع مشابه
A semi-analytical approach for the positive semidefinite Procrustes problem
The positive semidefinite Procrustes (PSDP) problem is the following: given rectangular matrices X and B, find the symmetric positive semidefinite matrix A that minimizes the Frobenius norm of AX − B. No general procedure is known that gives an exact solution. In this paper, we present a semi-analytical approach to solve the PSDP problem. First, we characterize completely the set of optimal sol...
متن کاملSymmetric, Positive Semidefinite Polynomials Which
This paper presents a construction for symmetric, non-negative polynomials, which are not sums of squares. It explicitly generalizes the Motzkin polynomial and the Robinson polynomials to families of non-negative polynomials, which are not sums of squares. The degrees of the resulting polynomials can be chosen in advance. 2000 Mathematics Subject Classification: 12Y05, 20C30, 12D10, 26C10, 12E10
متن کاملDeterministic Symmetric Positive Semidefinite Matrix Completion
We consider the problem of recovering a symmetric, positive semidefinite (SPSD) matrix from a subset of its entries, possibly corrupted by noise. In contrast to previous matrix recovery work, we drop the assumption of a random sampling of entries in favor of a deterministic sampling of principal submatrices of the matrix. We develop a set of sufficient conditions for the recovery of a SPSD matr...
متن کاملSchwarz Iterations for Symmetric Positive Semidefinite Problems
Convergence properties of additive and multiplicative Schwarz iterations for solving linear systems of equations with a symmetric positive semidefinite matrix are analyzed. The analysis presented applies to matrices whose principal submatrices are nonsingular, i.e., positive definite. These matrices appear in discretizations of some elliptic partial differential equations, e.g., those with Neum...
متن کاملDykstra’s Algorithm for the Optimal Approximate Symmetric Positive Semidefinite Solution of a Class of Matrix Equations
Dykstra’s alternating projection algorithm was proposed to treat the problem of finding the projection of a given point onto the intersection of some closed convex sets. In this paper, we first apply Dykstra’s alternating projection algorithm to compute the optimal approximate symmetric positive semidefinite solution of the matrix equations AXB = E, CXD = F. If we choose the initial iterative m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Linear Algebra
سال: 2019
ISSN: 1081-3810
DOI: 10.13001/1081-3810.4006